A new uniform lower bound on Weil–Petersson distance

نویسندگان

چکیده

In this paper we study the injectivity radius based at a fixed point along Weil–Petersson geodesics. We show that square root of is 0.3884-Lipschitz on Teichmüller space endowed with metric. As an application reprove systole function uniformly Lipschitz metric, where constant can be chosen to 0.5492. Applications asymptotic geometry moduli Riemann surfaces for large genus will also discussed.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Lower Bound on the Subriemannian Distance for Hölder Distributions

Whereas subriemannian geometry usually deals with smooth horizontal distributions, partially hyperbolic dynamical systems provide many examples of subriemannian geometries defined by non-smooth (namely, Hölder continuous) distributions. These distributions are of great significance for the behavior of the parent dynamical system. The study of Hölder subriemannian geometries could therefore offe...

متن کامل

A lower bound on the distance of cyclic codes

We present an algorithm to obtain a lower bound on the distance of cyclic codes, improving Schaub algorithm. In particular, we can provide new better bounds for the duals of binary primitive narrowsense BCH codes of length 255.

متن کامل

A New Lower Bound for Completion Time Distribution Function of Stochastic PERT Networks

In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of...

متن کامل

A New Lower Bound for Flexible Flow Shop Problem with Unrelated Parallel Machines

Flexible flow shop scheduling problem (FFS) with unrelated parallel machines contains sequencing in flow shop where, at any stage, there exists one or more processors. The objective consists of minimizing the maximum completion time. Because of NP-completeness of FFS problem, it is necessary to use heuristics method to address problems of moderate to large scale problem. Therefore, for assessme...

متن کامل

A New Lower Bound for Completion Time Distribution Function of Stochastic PERT Networks

In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Calculus of Variations and Partial Differential Equations

سال: 2022

ISSN: ['0944-2669', '1432-0835']

DOI: https://doi.org/10.1007/s00526-022-02254-z